关联规则增量式更新的改进算法

关联规则是数据挖掘中的重要研究内容之一，对在事务数据库不变，只对最小支持度和最小可信度进行改变的情况下，针对关联规则的维护问题，设计了一个增量式更新的改进算法AIUA。     

Blind Channel Identification Based on Noisy Observation by Stochastic Approximation Method

A stochastic approximation algorithm for estimating multichannel coefficients is proposed, and the estimate is proved to converge to the true parameters a.s. up-to a constant scaling factor. The estimate is updated after receiving each new observation, so the output data need not be collected in advance. The input signal is allowed to be dependent and the observation is allowed to be corrupted by noise, but no noise statistics are used in the estimation algorithm.     

Computing Zeta Functions of Kummer Curves via Multiplicative Characters

We present a practical polynomial-time algorithm for computing the zeta function of a Kummer curve over a finite field of small characteristic. Such algorithms have recently been obtained using a method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of interest in cryptography. We take a different approach. The problem is reduced to that of computing the L-function of a multiplicative character sum. This latter task is achieved via a cohomological formula based upon the work of Dwork and Reich. We show, however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota     

Some Properties of Quasi-keep-range Operators and Their Applications

ＳｏｍｅＰｒｏｐｅｒｔｉｅｓｏｆＱｕａｓｉ┐ｋｅｅｐ┐ｒａｎｇｅＯｐｅｒａｔｏｒｓａｎｄＴｈｅｉｒＡｐｐｌｉｃａｔｉｏｎｓＬａｉＣｈｕｎｈｕｉ（赖春晖）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＺｈａｎｇｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｅｇｅ，...     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

Inertia-preserving secant updates

Corrections to the last two equations of Ref. 1 are given.     

Some issues associated with the intermediate space in single-crystal plasticity

In this study we show that some discussions of finite-deformation single-crystal plasticity are conceptually flawed in their focus on a set referred to as the intermediate configuration. Specifically, we prove that what is usually referred to as the intermediate configuration is not a configuration but instead a vector space that we term the intermediate space. We argue that when applied to single crystals this intermediate space represents the lattice.     

一种基于Gauss von Mises分布模型的非线性量测更新方法

基于状态空间模型的许多传统滤波算法都基于Rn空间中的高斯分布模型,但当状态向量中包含角变量或方向变量时,难以达到理想的效果。针对J.T.Horwood等提出的nS?R流形上的Gauss Von Mises(GVM)多变量概率密度分布,扩展了狄拉克混合逼近方法,给出了联合分布的GVM逼近方法,推导了后验分布的GVM参数计算公式,设计了量测更新状态估计算法。将J.T.Horwood等的时间更新算法与所提出的量测更新算法相结合,可实现基于GVM分布的递推贝叶斯滤波器(GVMF)。仿真结果表明,当状态向量符合GVM概率分布模型时,GVMF对角变量的估计明显优于传统的扩展卡尔曼滤波器。     

Variational Solution of Stochastic Schrödinger Equations With Power-Type Nonlinearity

We investigate a Schrödinger problem with multiplicative Gaussian noise term and power-type nonlinearity on a bounded one-dimensional domain. In order to prove the existence and uniqueness of the variational solution, a further process will be introduced which allows to transform the stochastic nonlinear Schrödinger problem into a pathwise one. Galerkin approximations and compact embedding results are used.     

Some remarks on the symmetric rank-one update

We consider the symmetric rank-one, quasi-Newton formula. The hereditary properties of this formula do not require quasi-Newton directions of search. Therefore, this formula is easy to use in constrained optimization algorithms; no explicit projections of either the Hessian approximations or the parameter changes are required. Moreover, the entire Hessian approximation is available at each iteration for determining the direction of search, which need not be a quasi-Newton direction. Theoretical difficulties, however, exist. Even for a positive-definite, quadratic function with no constraints, it is possible that the symmetric rank-one update may not be defined at some iteration. In this paper, we first demonstrate that such failures of definition correspond to either losses of independence in the directions of search being generated or to near-singularity of the Hessian approximation being generated. We then describe a procedure that guarantees that these updates are well-defined for any nonsingular quadratic function. This procedure has been incorporated into an algorithm for minimizing a function subject to box constraints. Box constraints arise naturally in the minimization of a function with many minima or a function that is defined only in some subregion of the space.